全文获取类型
收费全文 | 10981篇 |
免费 | 566篇 |
国内免费 | 349篇 |
专业分类
化学 | 7119篇 |
晶体学 | 121篇 |
力学 | 413篇 |
综合类 | 29篇 |
数学 | 1914篇 |
物理学 | 2300篇 |
出版年
2023年 | 73篇 |
2022年 | 94篇 |
2021年 | 180篇 |
2020年 | 212篇 |
2019年 | 168篇 |
2018年 | 167篇 |
2017年 | 155篇 |
2016年 | 267篇 |
2015年 | 258篇 |
2014年 | 295篇 |
2013年 | 684篇 |
2012年 | 557篇 |
2011年 | 651篇 |
2010年 | 410篇 |
2009年 | 352篇 |
2008年 | 622篇 |
2007年 | 586篇 |
2006年 | 531篇 |
2005年 | 503篇 |
2004年 | 387篇 |
2003年 | 363篇 |
2002年 | 401篇 |
2001年 | 190篇 |
2000年 | 176篇 |
1999年 | 135篇 |
1998年 | 116篇 |
1997年 | 120篇 |
1996年 | 141篇 |
1995年 | 84篇 |
1994年 | 107篇 |
1993年 | 116篇 |
1992年 | 113篇 |
1991年 | 106篇 |
1990年 | 102篇 |
1989年 | 84篇 |
1988年 | 96篇 |
1987年 | 94篇 |
1985年 | 151篇 |
1984年 | 146篇 |
1983年 | 122篇 |
1982年 | 136篇 |
1981年 | 149篇 |
1980年 | 148篇 |
1979年 | 126篇 |
1978年 | 132篇 |
1977年 | 127篇 |
1976年 | 117篇 |
1975年 | 104篇 |
1974年 | 106篇 |
1973年 | 105篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
11.
就一般非完整约束系统,从约束方程满足的变分恒等式出发,利用增广位形流形上的向量场定义三类非自由变分,即非完整变分:vakonomic变分、Hlder变分、Suslov变分,并讨论它们之间的关系以及它们成为自由变分的充要条件.利用非完整变分以及相应的积分变分原理建立两类动力学方程:vakonomic方程和Routh方程或Chaplygin方程.通过vakonomic方程分别与Routh方程和Chaplygin方程比较,得到它们具有共同解的两类充分必要条件.这些条件并不是约束的可积性条件.
关键词:
非完整约束
非完整变分
Chetaev条件
vakonomic动力学 相似文献
12.
Charles J. Colbourn Sosina S. Martirosyan Gary L. Mullen Dennis Shasha George B. Sherwood Joseph L. Yucas 《组合设计杂志》2006,14(2):124-138
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006 相似文献
13.
14.
用磁控溅射方法制各纯Fe薄膜,并硫化合成FeS2.采用同步辐射X射线近边吸收谱与X射线光电子能谱研究了薄膜的电子结构.结果表明,合成的FeS2薄膜,在费米能级附近,有较强的Fe 3d态密度存在,同时,在价带谱中2-10eV处有强度较大的S 3p态密度存在;Fe的3d轨道在八面体配位场作用下分别为t2g和eg轨道,实验中由Fe的吸收谱计算得到两分裂能级之差为2.1eV;实验测得FeS2价带结构中导带宽度约为2.4eV,导带上方仍存在第二能隙,其宽度约为2.8eV. 相似文献
15.
Given a connected spaceX, we consider the effect of Quillen’s plus construction on the homotopy groups ofX in terms of its Postnikov decomposition. Specifically, using universal properties of the fibration sequenceAX→X→X
+, we explain the contribution of π
n
X to π
n
X
+, π
n+1
X
+ and π
n
AX, π
n+1
AX explicitly in terms of the low dimensional homology of π
n
X regarded as a module over π1
X. Key ingredients developed here for this purpose are universal II-central fibrations and a theory of universal central extensions
of modules, analogous to universal central extensions of perfect groups.
Research partially supported by NSERC of Canada. 相似文献
16.
We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures. 相似文献
17.
A localH-theorem is derived for a recently proposed extension of Enskog kinetic theory to a dense model fluid composed of particles with interactions extending beyond a hard core.On leave from: Katedra Fizyki, Uniwersytetu Szczecinskiego, 70-451 Szczecin, Poland. 相似文献
18.
19.
Quasi-wavelets (QWs) are a representation of turbulence consisting of self-similar, eddy-like structures with random orientations and positions in space. They are used in this paper to calculate the scattering, due to turbulent velocity fluctuations, of sound behind noise barriers as a function of the size and spatial location of the eddies. The sound scattering cross-section for QWs of an individual size class (eddy size) is derived and shown to reproduce results for the von Kármán spectrum when the scattered energies from a continuous distribution of QW sizes are combined. A Bragg resonance condition is derived for the eddy size that scatters most strongly for a given acoustic wavenumber and scattering angle. Results for scattering over barriers show that, for typical barrier conditions, most of the scattered energy originates from eddies in the size range of approximately one-half to twice the size of the eddies responsible for maximum scattering. The results also suggest that scattering over the barrier due to eddies with a line of sight to both the source and receiver is generally significant only for frequencies above several kilohertz, for sources and receivers no more than a few meters below the top of the barrier, and for very turbulent atmospheric conditions. 相似文献
20.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献